Clustering applications dealing with perception based or biased data lead to models with non-disjunct clusters. There, objects to be clustered are allowed to belong to several clusters at the same time which results in a fuzzy clustering. It can be shown that this is equivalent to searching all maximal cliques in dynamic graphs like Gt = (V,Et), where Et – 1Et, t = 1,...,T; E0 = . In this article algorithms are provided to track all maximal cliques in a fully dynamic graph. 相似文献
It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs . This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals.
For a class of symmetrically self-similar graphs we study the simple random walk on a cell graph , starting at a vertex of the boundary of . It is proved that the expected number of returns to before hitting another vertex in the boundary coincides with the resistance scaling factor.
Using techniques from complex rational iteration and singularity analysis for Green functions, we compute the asymptotic behaviour of the -step transition probabilities of the simple random walk on the whole graph. The results of Grabner and Woess for the Sierpinski graph are generalised to the class of symmetrically self-similar graphs, and at the same time the error term of the asymptotic expression is improved. Finally, we present a criterion for the occurrence of oscillating phenomena of the -step transition probabilities.
This is a summary of the most important results presented in the authors PhD thesis (Spanjaard 2003). This thesis, written in French, was defended on 16 December 2003 and supervised by Patrice Perny. A copy is available from the author upon request. This thesis deals with the search for preferred solutions in combinatorial optimization problems (and more particularly graph problems). It aims at conciliating preference modelling and algorithmic concerns for decision aiding.Received: March 2004, MSC classification:
91B06, 90C27, 90B40, 16Y60 相似文献
The main theme of this paper is that almost fixed point properties of discrete structures and fixed point properties of (topological) spaces are interdeducible via a suitable category which contains both graphs and spaces as objects. To carry out the program, we have to consider (almost) fixed points of multifunctions, and for this we need a preliminary discussion of power structures for graphs and simplicial complexes. Specific applications developed are: a digital convexity (discrete) version of Kakutani's fixed point theorem for convex-valued multifunctions; and fixed point properties of dendrites in terms of those of finite discrete trees. 相似文献
It is shown that every probability measure on the interval [0, 1] gives rise
to a unique infinite random graph g on vertices
{v1,
v2, . . .}
and a sequence of random graphs gn on vertices
{v1, . . . ,
vn}
such that
.
In particular,
for Bernoulli graphs with
stable property Q,
can be strengthened to: probability space (, F, P),
set of infinite graphs
G(Q) ,
F with property Q such
that
.AMS Subject Classification: 05C80, 05C62. 相似文献
Let Pk be a path on k vertices. In an earlier paper we have proved that each polyhedral map G on any compact 2-manifold
with Euler characteristic
contains a path Pk such that each vertex of this path has, in G, degree
. Moreover, this bound is attained for k = 1 or k 2, k even. In this paper we prove that for each odd
, this bound is the best possible on infinitely many compact 2-manifolds, but on infinitely many other compact 2-manifolds the upper bound can be lowered to
. 相似文献
Let f be a smooth nondegenerate real valued function on a finite dimensional, compact and connected Riemannian manifold. The bipartite min-max graph is defined as follows. Its nodes are formed by the set of local minima and the set of local maxima. Two nodes (a local minimum and a local maximum) are connected in by means of an edge if some trajectory of the corresponding gradient flow connects them. Given a natural number k, we construct a function f such that the length of the shortest path in between two specific local minima exceeds k. The latter construction is independent of the underlying Riemannian metric. 相似文献
In this paper we present a lower bound of the disjunctive rank of the facets describing the stable set polytope of joined a-perfect graphs. This class contains near-bipartite, t-perfect, h-perfect and complement of fuzzy interval graphs, among others. The stable set polytope of joined a-perfect graphs is described by means of full rank constraints of its node induced prime antiwebs. As a first step, we completely determine the disjunctive rank of all these constraints. Using this result we obtain a lower bound of the disjunctive index of joined a-perfect graphs and prove that this bound can be achieved. In addition, we completely determine the disjunctive index of every antiweb and observe that it does not always coincide with the disjunctive rank of its full rank constraint. 相似文献